package org.example.myleet.p1672;

public class Solution {
    public int maximumWealth(int[][] accounts) {
        int maxWealth = 0;
        for (int i = 0; i < accounts.length; ++i) {
            int sumWealth = 0;
            int[] wealthArr = accounts[i];
            for (int j = 0; j < wealthArr.length; ++j) {
                sumWealth += wealthArr[j];
            }
            maxWealth = Math.max(maxWealth, sumWealth);
        }
        return maxWealth;
    }
}
